Dynamic Directed Search†

نویسندگان

  • Gabriele Camera
  • Jaehong Kim
چکیده

The directed search model (Peters, 1984) is static; its dynamic extensions typically restrict strategies, often assuming price or match commitments. We lift such restrictions to study equilibrium when search can be directed over time, without constraints and at no cost. In equilibrium trade frictions arise endogenously, and price commitments, if they do exist, are self-enforcing. In contrast to the typical model, there exists a continuum of equilibria that exhibit trade frictions. These equilibria support any price above the static price, including monopoly pricing in arbitrarily large markets. Dispersion in posted prices can naturally arise as temporary or permanent phenomenon despite the absence of pre-existing heterogeneity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A depth-first approach to target-value search

In this paper, we consider how to improve the scalability and efficiency of target-value-path search on directed acyclic graphs. To this end, we introduce a depth-first heuristic search algorithm and a dynamic-programming method to compute the heuristic’s pattern database in linear (in the number of edges) time. We show the benefits of the new approach over previous work on this problem (Kuhn e...

متن کامل

Directed Motivational Currents: The Implementation of the Dynamic Web-Based Persian Scale among Iranian EFL Learners

Directed motivational current (DMC) ̶ as a novel strand in L2 motivational field ̶ is a robust motivational drive fueled by a highly valued goal and capable of stimulating and sustaining long-term behavior. The present study explored English as a foreign language students’ Directed Motivational Currents by validating the dynamic web-based Persian version of the scale, finding the most crucial mot...

متن کامل

Reusing Previously Found A* Paths for Fast Goal-Directed Navigation in Dynamic Terrain

Generalized Adaptive A* (GAA*) is an incremental algorithm that replans using A* when solving goal-directed navigation problems in dynamic terrain. Immediately after each A* search, it runs an efficient procedure that updates the heuristic values of states that were just expanded by A*, making them more informed. Those updates allow GAA* to speed up subsequent A* searches. Being based on A*, it...

متن کامل

Dynamic time warping for isolated word recognition based on ordered graph searching techniques

The technique of dynamic time warping (DTW) is relied on heavily in isolated word recognition systems. The advantage of using DTW is that reliable time alignment between reference and test patterns is obtained. The disadvantage of using DTW is the heavy computational burden required to find the optimal time alignment path. Several alternative procedures have been proposed for reducing the compu...

متن کامل

Searching Multiregression Dynamic Models of Resting-State fMRI Networks Using Integer Programming

A Multiregression Dynamic Model (MDM) is a class of multivariate time series that represents various dynamic causal processes in a graphical way. One of the advantages of this class is that, in contrast to many other Dynamic Bayesian Networks, the hypothesised relationships accommodate conditional conjugate inference. We demonstrate for the first time how straightforward it is to search over al...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015